Edge-labeling using dictionary-based relaxation
نویسندگان
چکیده
منابع مشابه
An efficient edge detection algorithm using relaxation labeling technique
Edge detection plays an important role in computer vision tasks, and has received considerable attention in image processing literature. To detect edges correctly and precisely, contextual information is needed. How to use contextual information is a key issue. In this paper, we introduce an edge detection method that will use edge contextual information of the whole image efficiency. This new ...
متن کاملPhysically-based edge labeling
A diversity of phenomenon can produce image intensity discontinuities. Information about the physical cause for image edges can provide crucial input to image understanding algorithms. We present a physically-based approach, using polarization, to distinguish 3 types of image edges: limb edges, specular edges, and albedo/physical edges. Assuming general imaging conditions and smooth dielectric ...
متن کاملSpeaker identification using relaxation labeling
A nonlinear probabilistic model of the relaxation labeling (RL) process is implemented in the speaker identification task in order to disambiguate the labeling of the speech feature vectors. Identification rates using the RL are higher than those using the conventional VQ (vector quantization) method.
متن کاملDictionary based Approach to Edge Detection
Edge detection is a very essential part of image processing, as quality and accuracy of detection determines the success of further processing. We have developed a new self learning technique for edge detection using dictionary comprised of eigenfilters constructed using features of the input image. The dictionary based method eliminates the need of pre or post processing of the image and accou...
متن کاملEdge pair sum labeling of spider graph
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1990
ISSN: 0162-8828
DOI: 10.1109/34.44403